支援時光平移播放之調適性現場直播演算法

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：87

、訪客IP：18.219.189.247

姓名

楊宏昌(Hung-Chang Yang ) 查詢紙本館藏

畢業系所

資訊工程研究所

論文名稱

支援時光平移播放之調適性現場直播演算法
(An Adaptive Live Broadcasting Scheme for Time-Shifting Playback)

相關論文

★ 整合多樣配置組態下的藍芽射頻驗證系統	★ 具檔案敘述相關語查詢之智慧型檔案搜尋系統
★ 具遲到者支援功能之網際網路簡報系統	★ 以快速廣播法建構熱門視訊隨選服務伺服器
★ 具事件同步再現特性之遠程電傳展示伺服器	★ 無線網路環境下之廣播資訊快速下載
★ 中文網站繁簡互訪協助系統	★ 用於互動式廣播之段落對齊法
★ 熱門影片廣播法之影片區段復原機制	★ 配合熱門影片廣播的本地伺服器高效快取法
★ 一個增進SIP在防火牆環境中應用的協同模組	★ 考量網頁熱門度之一致性雜湊法解決網頁代理伺服器之負載平衡
★ 以網域名稱伺服器為基礎之色情網站過濾系統	★ 使用熱門廣播法及支援點對點傳輸之影音內容傳遞網路
★ 變動頻寬平滑化之熱門廣播演算法	★ 支援變動播放速率及低暫存空間需求之熱門廣播法研究

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

近幾年來，由於電腦和通訊技術的快速發展，使得在網路上提供互動式多媒體服務變成是可行的。有越來越多的人除了可從報章雜誌、收音機、電視來獲得流行資訊及熱門新聞外，還可經由連上網際網路來取得這些資訊。然而，人們最想要獲得的熱門資訊是那些即時發生的事情。因此，他們想要連上網際網路來立即收看那些現場直播的節目。但是，由於提供影片的伺服器端必須要提供大量的頻寬才能滿足人們的需求。因此，在近幾年內是不可能實現的。所以，如何在有限的頻寬之下來提供越多人的服務變成是很關鍵性的問題。
由於人們收看的幾乎都是相同的熱門直播影片，所以影片所需的頻寬是有可能被共享的。假如我們能增加頻寬共享的機率，相信我們能減少頻寬的需求量。然而，現場直播節目的性質是：即時的播放出來並且它的產生率和播放速度是一樣的。我們不能夠事先取得影片並且存放到視訊伺服器內。更進一步地，使用者端也不能快速下載影片的後面部份。因此，雖然有很多的演算法被提出來減少頻寬的需求，但是都是為了那些可事先儲存在伺服器內的熱門影片而設計的，它們都不能很有效的拿來支援現場直播的節目。
在這裡，我們提出一個新的演算法，叫做“調適性現場直播演算法“。不但能支援時光平移播放，也能夠做到人數少時低頻寬的需求，人數多時保持在一定的頻寬之內。所謂的時光平移播放可以被分成兩種：第一種是可以允許晚到的人能夠從頭收看到正在進行的現場直播節目。第二種是面對即時性非常重要的節目，它們每小時播放的內容是會變動的，就像是每小時播放的即時新聞一樣。舊的新聞會被刪掉不播放，而新的新聞會被加入。

摘要(英)

In the recent year, the developments in computer and communication technologies have made it possible to provide interactive multimedia services. More and more households are connecting to the Internet to get popular information and hot news in addition to newspaper, magazine, radio and TV. However, real-time information is the hottest one that people want to access. People could connect to Internet to watch the live video immediately. But it is impractical in the near future due to the video server has to prepare or reserve a huge bandwidth. Therefore, how to use the limited bandwidth to accommodate as many users’ requests as possible is vital.
Since many people want to watch the same hot live video, the required bandwidth of live video is possible to be shared. If we increase the probability of sharing the bandwidth for the same video and using local disk to buffer posterior video data, we can reduce the require bandwidth of the video server. However, the characteristics of live video are playing/recording in real-time and its production rate is equal to playback rate. We cannot pre-fetch the video and store them in the disk of video server beforehand. Furthermore, the clients cannot fast-download the posterior portion of video. Many schemes are proposed to reduce the bandwidth requirements for stored popular videos, but they cannot be used to support live video broadcast perfectly.
Herein, we propose a new broadcasting scheme, called Adaptive Live Broadcasting (ALB) scheme, which supports time-shifting playback and perform well over a wide range of request arrival rates. Time-shifting playback can be classified into two playback types: the first one is it allows the late user to watch an on-going live video from the beginning while recording is still in progress. Another one is its timeliness is very important. The broadcast contents per hour of the live video are different. The older news would be abandoned, and the recent news would be added.

關鍵字(中)

★ 快速下載
★ 時光平移播放
★ 網路頻寬排程
★ 群播技術
★ 調適性現場直播演算法
★ 隨選視訊

關鍵字(英)

★ Adaptive Live Broadcasting Scheme
★ Fast Downloading
★ IP Multicasting
★ Network Bandwidth Scheduling
★ Time-Shifting Playback
★ Video-on-Demand

論文目次

Chapter 1 Introduction ………….………………………………………………1
1.1Motivation …………………………………………………………………...1
1.2Background ………………………………………………………………….2
1.2.1First-come-first-serve service policy …..…………………………..2
1.2.2Video broadcasting service policy …………………………………4
1.2.3Dynamic broadcasting service policy ……………………………...5
1.3Research goal ………………………………………………………………..6
1.4The dissertation organization ………………………………………………..8
Chapter 2 Related works …….……….………………………….…………….9
2.1 New pagoda broadcasting scheme ………………………………………….9
2.2 Recursive frequency splitting scheme ……………………………………...13
2.3 Fast broadcasting scheme …………………………………………………..16
2.4 Adaptive fast broadcasting scheme ………………………………………...18
2.5 Universal distribution scheme ……………………………………………...21
2.6 Stream tapping scheme ……………………………………………………..23
2.7 Hierarchical multicast stream merging scheme …………………………….25
2.8 Scalable binomial broadcasting scheme ……………………………………27
Chapter 3 Adaptive live broadcasting scheme …………………………….31
3.1 The development of adaptive live broadcasting scheme …………………...31
3.1.1 Minimum frequency scheduling……………………………………..33
3.1.2 Adaptive live broadcasting scheme………………………………….35
3.2 Efficiently broadcast ………………………………………………………..37
3.3 Broadcast instant news ……………………………………………………..38
Chapter 4 Analysis and comparison ………………………………………...39
4.1 Maximum number of segments with fixed channels ……………………….39
4.2 Waiting time vs. bandwidth allocation ……………………………………..40
4.3 Disk transfer rate requirements at client end ……………………………….42
Chapter 5 Simulation and results ……………………………………………44
Chapter 6 Conclusions ………………………………………………………...48

參考文獻

[1]Dan A., D. Sitaram and P. Shahabuddin, “Scheduling policies for an on-demand video server with batching”, Proc. ACM Multimedia Conference, pp. 15-23, Oct 1994.
[2]Dan A., D. Sitaram and P. Shahabuddin, “Dynamic batching policies for an on-demand video server”, Multimedia System, 4(3):112-121, Jun 1996.
[3]C. C. Aggarwal, J. L. Wolf and P. S. Yu, “A permutation-based pyramid broadcasting scheme for video-on-demand systems”, IEEE Proceedings of the International Conference on Multimedia Computing and Systems, pp. 118-126, Jun 1996.
[4]T. Chiueh and C. Lu, “A periodic broadcasting approach to video-on-demand service”, SPIE, vol. 2615, pp. 162-169, Oct 1995.
[5]S. W. Carter and D. D. E. Long, “Improving video-on-demand server efficiency through stream tapping”, Proc. 5th Int. Conf. On Computer Communications and Networks, pp. 200-207, Sep 1997.
[6]Chi-He Chang, Jang-Ping Sheu and Yu-Chee Tseng, “A Recursive Frequency-Splitting Scheme for Broadcasting Hot Videos in VOD Service”, M. S. Thesis, Department of Computer Science and Information Engineering, National Central University, Chung-Li, Taiwan, R.O.C., Jun 2000.
[7]D. L. Eager and M. K. Vernon, “Dynamic skyscraper broadcast for video-on-demand”, Proc. 4th Int. Workshop on Advances in Multimedia Information Systems, pp. 18-32, Sep 1998.
[8]D. L. Eager, M. K. Vernon and J. Zahorjan, “Bandwidth Skimming: A Technique for Cost-Effective Video-on-Demand”, Proc. IS&T/SPIE Conf. On Multimedia Computing and Networking 2000 (MMCN 2000), San Jose, CA, pp. 206-215, Jan 2000.
[9] D. L. Eager, M. K. Vernon and J. Zahorjan, “Minimizing bandwidth requirements for on-demand data delivery”, Proc. 5th Int. Workshop on Advances in Multimedia Information Systems, Oct 1999.
[10]A. K. Hua and S. Sheu, “Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems”, Proc. ACM SIGCOMM ’97 Conf., pp. 89-100, Sep 1997.
[11]K. A. Hua, Y. Cai and S. Sheu, “Patching: a multicast technique for true video-on-demand services”, Proc. 6th ACM Multimedia Conf., pp. 191-200, Sep 1998.
[12]L-S. Juhn and L-M. Tseng, “Fast broadcasting for hot video access”, RTCSA’97: the proceedings of the 4th international workshop on real-time computing systems and applications, pp.237-243, Oct 1997.
[13]L-S. Juhn and L-M. Tseng, “Harmonic broadcasting for video-on-demand service”, IEEE Trans. Broadcasting, vol. 43, no.3, pp. 268-271, Sep 1997.
[14]L-S. Juhn and L-M. Tseng, “Staircase data broadcasting and receiving scheme for hot video service”, IEEE Trans. Consumer Electronics, vol. 43, no.4, pp. 1110-1117, Nov 1997.
[15]L-S. Juhn and L-M. Tseng, “Enhanced harmonic data broadcasting and receiving scheme for popular video service”, IEEE Trans. Consumer Electronics, vol. 44, no. 2, pp. 343-346, May 1998.
[16]L-S. Juhn and L-M. Tseng, “Fast data broadcasting and receiving scheme for popular video service”, IEEE Trans. Broadcasting, vol. 44, no. 1, pp. 100-105, Mar 1998.
[17]L-S. Juhn and L-M. Tseng, “Adaptive fast data broadcasting scheme for video-on-demand service”, IEEE Trans. Broadcasting, vol. 44, no. 2, pp. 182-185, Jun 1998.
[18]T. D. C. Little and D. Venkatesh, “Prospects for interactive video-on-demand”, IEEE Multimedia, vol. 1, no. 3, pp. 14-24, Fall 1994.
[19]J-F. Paris, S. W. Carter and D. D. E. Long, “A Hybrid broadcasting protocol for video on demand”, Proc. 1999 Multimedia Computing and Networking Conference, San Jose, CA, pp. 317-326, Jan 1999.
[20]J-F. Paris, “A simple low bandwidth broadcasting protocol for video on demand”, Proc. 7th Int. Conf. On Computer Communications and Networks, pp. 690-697, Oct 1999.
[21]J-F. Paris, S. W. Carter and D. D. E. Long, “A universal distribution protocol for video-on-demand”, Proc. 1st Int. Conf. On Multimedia and Expo 2000, vol. 1, pp. 49-52, Jul 2000.
[22]V. Rangan, H. Vin and S. Ramanathan, “Designing an on-demand multimedia service”, IEEE Communications Magazine, vol. 30, no. 7, pp. 56-65, Jul 1992.
[23]S. Viswanathan and T. Imielinki, “Metropolitan area video-on-demand service using pyramid broadcasting”, Multimedia Systems, vol. 4, pp. 197-208, 1996.
[24]J. W. Wong, “Broadcast delivery”, Proceedings of the IEEE, 76(12): 1566-1577, Dec 1988.
[25]Z. Y. Yang, L. S. Juhn, Y. M. Chen and L. M. Tseng, “On Live Broadcasting Schemes with Latecomer Support”, Ph. D. Thesis, Department of Computer Science and Information Engineering, National Central University, Chung-Li, Taiwan, R.O.C., Jun 2000.
[26]Pei-Fen You and J-F. Paris, “A Better Dynamic Broadcasting Protocol for Video-on-demand”, 20th IEEE International Performance, Computing and Communications Conference, Phoenix, AZ, Apr 2001.

指導教授

曾黎明(Li-Ming Tseng)

審核日期

2001-7-9

推文